ULD-Lattices and ∆-Bonds
نویسندگان
چکیده
We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this characterization yields a slick proof of distributivity or UL-distributivity. This is exemplified by proving a distributive lattice structure on ∆-bonds with invariant circular flow-difference. This instance generalizes several previously studied lattice structures, in particular, c-orientations (Propp), α-orientations of planar graphs (Felsner, resp. de Mendez) and planar flows (Khuller, Naor and Klein). The characterization also applies to other instances, e.g. to chip-firing games.
منابع مشابه
J ul 2 00 8 ULD - Lattices and ∆ - Bonds
We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this characterization yields a slick proof of distributivity or UL-distributivity. This is exemplified by proving a distributive lattice structure on ∆-bonds with inva...
متن کاملCharacterization of Lattices Induced by (extended) Chip Firing Games
The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurations reachable from an initial configuration (this set is called the configuration space) can be ordered as a lattice. We first present a structural result about this model, which allows us to introduce some useful tools for describing those lattices. T...
متن کاملDistributive Lattices from Graphs
Several instances of distributive lattices on graph structures are known. This includes c-orientations (Propp), α-orientations of planar graphs (Felsner/de Mendez) planar flows (Khuller, Naor and Klein) as well as some more special instances, e.g., spanning trees of a planar graph, matchings of planar bipartite graphs and Schnyder woods. We provide a characterization of upper locally distributi...
متن کاملCharacterisation of Lattices Induced by (extended) Chip Firing Games
The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurations reachable from an initial configuration (this set is called the configuration space) can be ordered as a lattice. We first present a structural result about this model, which allows us to introduce some useful tools for describing those lattices. T...
متن کاملLattices generated by Chip Firing Game models: Criteria and recognition algorithms
It is well-known that the class of lattices generated by Chip Firing games (CFGs) is strictly included in the class of upper locally distributive lattices (ULD). However a necessary and sufficient criterion for this class is still an open question. In this paper we settle this problem by giving such a criterion. This criterion provides a polynomial-time algorithm for constructing a CFG which ge...
متن کامل